Mix-Automatic Sequences
نویسندگان
چکیده
Mix-automatic sequences form a proper extension of the class of automatic sequences, and arise from a generalization of finite state automata where the input alphabet is state-dependent. In this paper we compare the class of mix-automatic sequences with the class of morphic sequences. For every polynomial φ we construct a mix-automatic sequence whose subword complexity exceeds φ. This stands in contrast to automatic and morphic sequences which are known to have at most quadratic subword complexity. We then adapt the notion of k-kernels to obtain a characterization of mix-automatic sequences, and employ this notion to construct morphic sequences that are not mix-automatic.
منابع مشابه
Automatic Identification and Classification of the Iranian Traditional Music Scales (Dastgāh) and Melody Models (Gusheh): Analytical and Comparative Review on Conducted Research
Background and Aim: Automatic identification and classification of the Iranian traditional music scales (Dastgāh) and melody models (Gusheh) has attracted the attention of the researchers for more than a decade. The current research aims to review conducted researches on this area and consider its different approached and obstacles. Method: The research approach is content analysis and data col...
متن کاملAutomatic Minimisation of Masking in Multitrack Audio using Subgroups
The iterative process of masking minimisation when mixing multitrack audio is a challenging optimisation problem, in part due to the complexity and non-linearity of auditory perception. In this article, we first propose a multitrack masking metric inspired by the MPEG psychoacoustic model. We investigate different audio processing techniques to manipulate the frequency and dynamic characteristi...
متن کاملOptimal Description of Automatic Paperfolding Sequences
The class of 2-automatic paperfolding sequences corresponds to the class of ultimately periodic sequences of unfolding instructions. We rst show that a paper-folding sequence is automatic ii it is 2-automatic. Then we provide families of minimal nite-state automata, minimal uniform tag sequences and minimal substitutions describing automatic paperfolding sequences, as well as a family of algebr...
متن کاملSpeci cation and Veri cation of Data driven Web Services
We study data driven Web services provided by Web sites interacting with users or applications The Web site can access an underlying database as well as state information updated as the interaction pro gresses and receives user input The structure and contents of Web pages as well as the actions to be taken are determined dynamically by querying the underlying database as well as the state and ...
متن کاملAutomatic detection of liver tumor motion by fluoroscopy images
Background: A method to track liver tumor motion signals from fluoroscopic images without any implanted gold fiducial markers was proposed in this study to overcome the adverse effects on precise tumor irradiation caused by respiratory movement. Materials and Methods: The method was based on the following idea: (i) Before treatment, a series of fluoroscopic images corresponding to different bre...
متن کامل